On factorisations of complete graphs into circulant graphs and the Oberwolfach Problem
نویسندگان
چکیده
Various results on factorisations of complete graphs into circulant graphs and on 2factorisations of these circulant graphs are proved. As a consequence, a number of new results on the Oberwolfach Problem are obtained. For example, a complete solution to the Oberwolfach Problem is given for every 2-regular graph of order 2p where p ≡ 5 (mod 8) is prime.
منابع مشابه
Perfect 1-Factorisations of Circulants with Small Degree
A 1-factorisation of a graph G is a decomposition of G into edge-disjoint 1-factors (perfect matchings), and a perfect 1-factorisation is a 1-factorisation in which the union of any two of the 1-factors is a Hamilton cycle. We consider the problem of the existence of perfect 1-factorisations of even order circulant graphs with small degree. In particular, we characterise the 3-regular circulant...
متن کاملOn the perfect 1-factorisation problem for circulant graphs of degree 4
A 1-factorisation of a graph G is a partition of the edge set of G into 1factors (perfect matchings); a perfect 1-factorisation of G is a 1-factorisation of G in which the union of any two of the 1-factors is a Hamilton cycle in G. It is known that for bipartite 4-regular circulant graphs, having order 2 (mod 4) is a necessary (but not sufficient) condition for the existence of a perfect 1-fact...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملCirculant Homogeneous Factorisations of Complete Digraphs Kpd with p an Odd Prime
Let F = (Kn,P) be a circulant homogeneous factorisation of index k, that means P is a partition of the arc set of the complete digraph Kn into k circulant factor digraphs such that there exists σ ∈ Sn permuting the factor circulants transitively amongst themselves. Suppose further such an element σ normalises the cyclic regular automorphism group of these circulant factor digraphs, we say F is ...
متن کاملJust chromatic exellence in fuzzy graphs
A fuzzy graph is a symmetric binary fuzzy relation on a fuzzy subset. The concept of fuzzy sets and fuzzy relations was introduced by L.A.Zadeh in 1965cite{zl} and further studiedcite{ka}. It was Rosenfeldcite{ra} who considered fuzzy relations on fuzzy sets and developed the theory of fuzzy graphs in 1975. The concepts of fuzzy trees, blocks, bridges and cut nodes in fuzzy graph has been studi...
متن کامل